Superlinear Convergence of an Interior-point Method for Monotone Variational Inequalities
نویسندگان
چکیده
We describe an infeasible-interior-pointalgorithmfor monotone variational inequality problems and prove that it converges globally and superlinearly under standard conditions plus a constant rank constraint quali cation. The latter condition represents a relaxation of the two types of assumptions made in existing superlinear analyses; namely, linearity of the constraints and linear independence of the active constraint gradients. AMS(MOS) subject classi cations. 90C33, 90C30, 49M45
منابع مشابه
Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
We show that an interior-point method for monotone variational inequalities exhibits superlinear convergence provided that all the standard assumptions hold except for the well-known assumption that the Jacobian of the active constraints has full rank at the solution. We show that superlinear convergence occurs even when the constant-rank condition on the Jacobian assumed in an earlier work doe...
متن کاملA Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
Approximating fixed points of nonexpansive mappings and solving systems of variational inequalities
A new approximation method for the set of common fixed points of nonexpansive mappings and the set of solutions of systems of variational inequalities is introduced and studied. Moreover, we apply our main result to obtain strong convergence theorem to a common fixed point of a nonexpannsive mapping and solutions of a system of variational inequalities of an inverse strongly mono...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملA Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
We present an infeasible-interior-point algorithm for monotone linear complementarity problems in which the search directions are affine scaling directions and the step lengths are obtained from simple formulae that ensure both global and superlinear convergence. By choosing the value of a parameter in appropriate ways, polynomial complexity and convergence with Q-order up to (but not including...
متن کامل